computational complexity theory

Results: 2049



#Item
861Welcome  • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter.

Welcome • September 10th (Fri) – Final version due Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter.

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:19:59
862Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´

Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2013-07-26 10:03:32
863Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big

Newsletter of the PC Community NovemberWelcome Bergen Algorithmics Wins Big

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 04:47:38
864THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr

THE COMPLEXITY OF ANALOG COMPUTATION † Anastasios VERGIS Department of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. Kenneth STEIGLITZ Department of Computer Science, Princeton University, Pr

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2001-11-25 03:18:59
865Microsoft Word - Complexity_Map.doc

Microsoft Word - Complexity_Map.doc

Add to Reading List

Source URL: www.per.marine.csiro.au

Language: English - Date: 2007-03-20 20:52:03
866DattaKuestersMitchellRamanathan-TCC-2005.dvi

DattaKuestersMitchellRamanathan-TCC-2005.dvi

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2007-12-18 01:20:50
867FA11_apps_adm_acc_new.xlsx

FA11_apps_adm_acc_new.xlsx

Add to Reading List

Source URL: grad.ucsd.edu

Language: English - Date: 2014-10-31 13:42:31
868Sustaining Moore’s Law in Embedded Computing through Probabilistic and Approximate Design: Retrospects and Prospects Krishna V. Palem  Lakshmi N.B. Chakrapani

Sustaining Moore’s Law in Embedded Computing through Probabilistic and Approximate Design: Retrospects and Prospects Krishna V. Palem Lakshmi N.B. Chakrapani

Add to Reading List

Source URL: www.ece.rice.edu

Language: English - Date: 2012-08-15 22:20:27
869CS109A Notes for LectureAnalysis of Mergesort Input size n = length of list to be sorted; Tms(n) = running time of mergesort. 1. Call split on list of length n; takes O(n) time

CS109A Notes for LectureAnalysis of Mergesort Input size n = length of list to be sorted; Tms(n) = running time of mergesort. 1. Call split on list of length n; takes O(n) time

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:00
870Low-Knowledge Algorithm Control∗ Tom Carchrae and J. Christopher Beck Cork Constraint Computation Center University College Cork, Ireland {t.carchrae, c.beck}@4c.ucc.ie

Low-Knowledge Algorithm Control∗ Tom Carchrae and J. Christopher Beck Cork Constraint Computation Center University College Cork, Ireland {t.carchrae, c.beck}@4c.ucc.ie

Add to Reading List

Source URL: tidel.mie.utoronto.ca

Language: English - Date: 2006-01-18 12:07:28